A technique for proving uniformity

A new technique for proving uniqueness for martingale problems

A new technique for proving uniqueness of martingale problems is introduced. The method is illustrated in the context of elliptic diffusions in Rd.

Proving uniformity and independence by self-composition and coupling

Proof by coupling is a classical proof technique for establishing probabilistic properties of two probabilistic processes, like stochastic dominance and rapid mixing of Markov chains. More recently, couplings have been investigated as a useful abstraction for formal reasoning about relational properties of probabilistic programs, in particular for modeling reduction-based cryptographic proofs a...

A Sampling Technique of Proving Lower Bounds for Noisy Computations

We present a technique of proving lower bounds for noisy computations. This is achieved by a theorem connecting computations on a kind of randomized decision trees and sampling based algorithms. This approach is surprisingly powerful, and applicable to several models of computation previously studied. As a first illustration we show how all the results of Evans and Pippenger (SIAM J. Computing,...

A technique for automatically proving termination of constructor systems

A technique is described to prove termination of constructor systems (CSs) automatically. The technique consists of three major steps. First, determine the dependency pairs of a constructor system. Second, nd an equational theory in which the constructor system is contained, and third, prove that no in nite chain w.r.t. the equational theory of these dependency pairs exists. The rst step is eas...

Proving Properties of Interactive Proofs by a Generalized Counting Technique